System and method for fusing data from different information sources with shared-sampling distribution based boosting

ABSTRACT

A boosting—based method and system for fusing a set of classifiers that performs classification using weak learners trained on different views of the training data. The final ensemble contains learners that are trained on examples sampled with a shared sampling distribution. The combination weights for the final weighting rule are obtained at each iteration based on the lowest training error among the views. Weights are updated in each iteration based on the lowest training error among all views at that iteration to form the shared sampling distribution used at the next iteration. In each iteration, a weak learner is selected from the pool of weak learners trained on disjoint views based on the lowest training error among all views, resulting in a lower training and generalization error bound of the final hypothesis.

CROSS-REFERENCE TO RELATED APPLICATIONS

This Application is a non-provisional application under 35 USC 119(e) of provisional application 60/820,527 filed on Jul. 27, 2006, the entire disclosure of which is incorporated herein in its entirety.

TECHNICAL FIELD

The invention is related to information fusion, and more specifically, to boosting-based information fusion methods.

BACKGROUND OF THE INVENTION

A goal of data fusion is to obtain a classifier h such that h learns from all the views available for each training point and has classification accuracy that is better than the case when only one view is available. It is not always possible to separate the classes using information from a single view. However, if information from all the views is combined, a better classification performance may be achieved. Thus, a good fusion algorithm can outperform individual classifiers.

Considerable research in the pattern recognition field is focused on fusion rules that aggregate the outputs of the first level experts and make a final decision, as discussed in J. Kittler, “Combining Classifiers: A Theoretical Framework,” Pattern Analysis and Applications, Vol. 1, pp. 18-27, Springer, 1998, and J. Kittler, “A Framework for Classifier Fusion: Is Still Needed?” Lecture Notes in Computer Science, Vol. 1876, pp. 45-56, 2000.

Wolpert describes stacked generalization as a general technique for construction of multi-level learning systems, in Wolpert, D. H., “Stacked generalization”, Neural Networks, Vol. 5, pp. 241-259 (1992). In the context of classifier combination, stacked generalization can yield unbiased, full-size training sets for the trainable combiner.

Lanckriet, G. R., et al., “Kernel-based data fusion and its application to protein function prediction in yeast”, Proceedings of the Pacific Symposium on Biocomputing, Vol. 9, pages 300-311 (2004) discloses a kernel-based data fusion approach for protein function prediction in yeast that combines multiple kernel representations in an optimal fashion by formulating the problem as a convex optimization problem to be solved using semidefinite programming techniques.

Techniques for fusing expert observations include linear weighted voting, the naïve Bayes classifiers, the kernel function approach, potential functions, decision trees or multilayer perceptrons. Such techniques are described in J. Kittler, M. Hatef, R. P. W. Duin, and J. Matas, “On Combining Classifiers,” IEEE Trans. Pattern Analysis and Machine Intelligence, Vol. 20, pp. 226-239, 1998; L. I. Kuncheva, J. C. Bezdek, and R. P. W. Duin, “Decision Templates for Multiple Classifier Fusion: An Experimental Comparison,” Pattern Recognition, Vol. 34, pp. 299-314, 2001; L. Xu, A. Krzyzak, and C. Y. Suen, “Methods of Combining Multiple Experts for the Recognition of Unconstrained Handwritten Numerals,” IEEE Trans. Systems, Man, and Cybernetics, Vol. 22, pp. 418-435, 1992; and S. Hashem, “Optimal Linear Combination of Neural Networks,” Neural Networks, Vol. 19, pp. 599-614, 1997.

Boosting techniques are intended to improve the prediction accuracy of learning methods, by combining weak classifiers, having poor performance, into a strong classification rule with a better performance. A system known as AdaBoost is described in Y. Freund and R. E. Schapire, “A decision-Theoretic Generalization of On-Line Learning and an Application to Boosting,” J. Computer and Systems Science, Vol. 55, pp. 119-139, 1997, and in Y. Freund and R. Schapire, “A short introduction to boosting”, Journal of Japanese Society for Artificial Intelligence, 5(14):771 780, September 1999.

BRIEF SUMMARY OF THE INVENTION

One embodiment of the invention is directed to a boosting—based method and system for fusing a set of classifiers that performs classification using weak learners trained on different views of the training data. The final ensemble contains learners that are trained on examples sampled with a shared sampling distribution. The combination weights for the final weighting rule are obtained at each iteration based on the lowest training error among the views. Weights are updated in each iteration based on the lowest training error among all views at that iteration to form the shared sampling distribution used at the next iteration. In each iteration, a weak learner is selected from the pool of weak learners trained on disjoint views based on the lowest training error among all views, resulting in a lower training and generalization error bound of the final hypothesis.

An embodiment of the invention is directed to a robust method for fusing data from different information sources. The method includes initially assigning weights to each of a plurality of training examples, and iteratively for each view: separately training weak classifiers h_(k) on a sample of training examples based on the distribution of the weights, selecting the weak classifier corresponding to the view with the lowest error rate, and updating the weights of the training examples based on the lowest error rate among all views.

Another embodiment of the invention is directed to a system for fusing data from different information sources. The system comprises an assignment module for initially assigning weights to each of a plurality of training examples; a training module for separately training for each view weak classifiers h_(k) on a sample of training examples based on the distribution of the weights; a selector that selects a weak classifier at each iteration corresponding to the view with the lowest error rate; and an updater that updates the weights of the training examples based on the lowest error rate among all views. The updated weights of the training examples have the same value for each view in an iteration, and the updated weights for each iteration are based on the lowest error rate among all views of the iteration.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is an illustration of a method for data fusion in accordance with an embodiment of the invention.

FIG. 2 a more detailed illustration of the method of FIG. 1.

FIGS. 3-5 show experimental results of testing the FIG. 2 BSSD method, a stacked generalization method, a semidefinite programing (SDP/SVM) and a majority vote (SVM-MV) method with five data sets from the MIT VisTex texture database.

FIG. 6 illustrates the results of comparing the FIG. 2 BSSD method with another embodiment of a boosting method in the presence of noise on MIT VisTex data sets.

FIGS. 7, 8, 9, and 10 present experimental results for SVM-MV, Stacked—SVM, SDP-SVM, and BSSD methods for three FERET data sets.

FIGS. 11, 12, and 13 summarize fusion accuracy for three FERET data sets.

FIGS. 14, 15, and 16 illustrate experimental results of AdaBoost—MV, AdaBoost Concatenated, and BSSD data fusion methods for three FERET data sets.

DETAILED DESCRIPTION OF THE INVENTION

Embodiments of the invention are directed to a boosting—based method for fusing a set of classifiers that performs classification using weak learners trained on different views of the training data sampled with a shared sampling distribution. The final ensemble contains learners that are trained to focus on different views of the test data. In each iteration the combination weights for the final weighting rule are obtained using the lowest training error among all views. The shared sampling weights distribution is updated based on the lowest training error among all views at that iteration. In each iteration, a weak learner is selected from the lowest training error view, resulting in a lower training and generalization error bound of the final hypothesis.

As illustrated in the embodiment of FIG. 1, input 21 includes a training set S of N training points with M disjoint features available for each point. In an initialization step 22, all the views for a given training point are initialized with the same initial weight w₁(i)=1/N. Next, for a number of iterations k=1 to k=k_(max), the classifiers are separately trained on each view on a sample of training examples based on the shared distribution of the weights 23, weak hypotheses are obtained for each view 24. A training error rate ε^(j) _(k) is calculated for each view. After a classifier h_(k)* with lowest error rate is selected and combination weight α_(k)* is obtained, the weights of the training data views are updated 25 forming a shared sampling distribution that will be used to sample training data at the next iteration. A final hypothesis or classifier is output 26 from the system.

FIG. 2 describes the method of FIG. 1 in greater detail. Input 30 includes a training set S of data of N training points X={x₁, x₂ . . . x_(N)}. M disjoint features are available for each point x_(i)={x¹ _(i), x² _(i) . . . x^(M) _(i)}. Each member x^(j) _(i) in the set x_(i) is known as a view of point x_(i). Each (x^(j) _(i),y_(i)) pair represents the j^(th) view and class label of the i^(th) training example. Since M disjoint features are available for each point, there will be M training sets. The set S is represented as S_(j)={(x^(j) ₁, y₁), (x^(j) ₂, y₂) . . . (x^(j) _(N), y_(N))}, where j=1 . . . M and y_(i) ∈ {+1,−1} and each (x^(j) _(i),y_(i)) pair represents the j^(th) view and class label of the i^(th) training example.

A view may be thought of as a representation of point x_(i) using disjoint feature sets. For instance, for a color image, each training point x_(i) may be thought of as a set of three views each consisting of three disjoint features obtained from the intensities of Red, Green and Blue color components. For an example where the three views are Red, Green, and Blue intensities, the views of the point x_(i) can be represented as {x^(R) _(i), x^(G) _(i), x^(B) _(i)}.

In an initialization step 31, all the views for a given training point x_(i) are initialized with the same weight w^(j) ₁ (i)=1/N.

As an example, for three views (red, green, and blue intensities), N training examples each have three disjoint views and a given training example x_(i) can be represented as {x^(R) _(i), x^(G) _(i), x^(B) _(i)}. The initial weight for each view will be w^(R) _(i)(i)=w^(G) _(i)(i)=w^(B) ₁(i)=1/N.

In a number of iterations from k=1 to k=k_(max), the training set is sampled 32 according to the weights of the training points. In the first iteration, the original training set is sampled according to the initially assigned weights. In each iteration, the original training set is sampled according to updated weights of the training points. As the number of iterations progresses, the training points which are difficult to classify from the winning views in previous iterations accumulate high values of sampling weights, so are more likely to be sampled.

In step 33, for each view, the weak classifiers C_(k) ^(j) are separately trained on training examples sampled based on the weights' distribution. For example, for each view j, train classifiers h^(j) _(k) on data sets sampled using weights distribution W_(k). In the red-green-blue example, for each view j, weak learners h^(R), h^(G) and h^(B) will be trained on the training sets X^(R)={x^(R) ₁, x^(R) ₂ . . . , x^(R) _(N)}, X^(G)={X^(G) ₁, X^(G) ₂, . . . , X^(G) _(N)}, and X^(B)={x^(B) ₁, x^(B) ₂, . . . X^(B) _(N)}, such that X={X^(R)U X^(G)U X^(B)}.

Next, in step 35, obtain the training error rates ∈^(j) _(k) of each h^(j) _(k) over the distribution Wk such that ε_(k) ^(j)=P_(i-Wk)└h_(k) ^(j)(x_(i) ^(j)) ≠y_(i)┘.

The error rates from the M views at iteration k are {ε_(k) ¹, ε_(k) ², . . . , ε_(k) ^(M)}. One of the M views will have the lowest error rate ∈*_(k) of the views at that iteration, ε*_(k)=min{ε_(k) ¹, ε_(k) ², . . . , ε_(k) ^(M). If errors from each of the M views {ε_(k) ¹, ε_(k) ², . . . , ε_(k) ^(M)} are less than 0.5, in step 36, select the weak hypothesis h*_(k) with the lowest error rate ∈*_(k) among all views, ε*_(k)=min {ε_(k) ¹, ε_(k) ², . . . , ε_(k) ^(M)}.

Next, in step 37, for the lowest error rate ε*_(k) at iteration k calculate a combination weight value α*_(k) as

$\alpha_{k}^{*} = {\frac{1}{2}{{\ln\left( \frac{1 - ɛ_{k}^{*}}{ɛ_{k}^{*}} \right)}.}}$

In step 38, update weights of the views as

${w_{k + 1}(i)} = {\frac{w_{k}(i)}{Z_{k}^{*}} \times \left\{ \begin{matrix} {\exp\left( {- \alpha_{k}^{*}} \right)} & {if} & {{h_{k}^{*}\left( x_{i}^{*} \right)} = y_{i}} \\ {\exp\left( \alpha_{k}^{*} \right)} & {if} & {{h_{k}^{*}\left( x_{i}^{*} \right)} \neq y_{i}} \end{matrix} \right.}$

where h*_(k) is the classifier with lowest error rate ∈*_(k) in the k^(th) iteration. Z*_(k) is the normalizing factor so that W_(k+1) is a distribution. W_(k+1) is the shared sampling distribution that will be used to sample the training examples at the next iteration k+1.

Note that since the sampling distribution for all views of a given example is shared, the sampling weight of the R, G and B views of example x_(i) in iteration k are given by w^(R,G,B) _(k)(i)=w^(R) _(k)(i)=w^(G) _(k)(i)=w^(B) _(k)(i).

After k_(max) iterations, a decision function F(x) is found as

${F(x)} = {\sum\limits_{k = 1}^{k\mspace{11mu}\max}\;{\alpha_{k}^{*}{{h_{k}^{*}\left( x^{*} \right)}.}}}$

The resulting hypothesis H(x) is H(x)=sign (F(x)).

This method performs classifier selection based on the lowest training error among the views at each iteration. In each iteration, sampling and weight update is performed using a shared sampling distribution. As a result, the weights for all views of a given training example are updated according to the opinion of the classifier from the lowest error view. In the first few iterations, weak learners from only those views give a good classification accuracy that provide a good separability among the training points. So in the first iteration, a weak learner from that view is likely to be lowest error weak learner that inherently is a more separable view. As the number of iterations progresses, the training points which are difficult to classify from the winning views in previous iterations accumulate high values of sampling weights . Thus, in later iterations, examples will be sampled according to a distribution that is more likely to sample examples that were deemed difficult by previously winning views. A winning classifier is less likely to emerge from the views that were winning views in previous iterations. This results in a cyclic behavior and the classifiers that lose for some iterations eventually have a low weighted error rate and become a winning classifier for a given iteration. This cyclic behavior continues until there is a consensus between the classifiers over which training examples are difficult to classify. In the end, all weak learners from all classifiers agree on what examples are difficult and try to achieve a low error rate. Thus, weak learners trained on individual views in each iteration rectify the bias introduced by learners in preceding iterations resulting in a self-regularizing behavior.

Other embodiments of the invention include devices such as computer systems and computer-readable media having programs or applications to accomplish the exemplary methods described herein.

Other examples of systems that can incorporate these methods are automatic target recognition systems, intelligent electronic navigational systems with in which the features are available from visible range data, infrared sensors data and radar data regarding a specific region of interest.

Another example of a system that can incorporate these methods is a user detection and Recognition system in which the features are biometric, e.g., fingerprints, iris, face, voice data.

Another example of a system that can accomplish these methods is a system for gene function prediction, prediction of protein structure and localization (Bioinformatics). The features can be descriptions of the same data set, each capturing different aspects of the data, such as sequence, expression, protein and regulation information.

Another example application of these methods is a system for skin disease prediction based on texture image analysis (Medical Imaging). The features may be available from the Red, Green and Blue components extracted from the actual color images and/or thermal images etc.

Advantages of the method and system described herein are that the method can have higher accuracy than existing classifier fusion techniques, and better robustness to noise than competing classifier fusion strategies due to the self-regularization mechanism.

The method and system described herein can be used in any situation where features can be extracted from more than one source. This method is particularly useful when the training data is noisy. Robustness under noise is a feature that is essential for any information fusion system due the very nature of different scenarios where such systems are employed. For instance, in a multimodal biometric system it may not be always possible to get the ‘perfect fingerprint’ of an individual due to dust being accumulated on the sensor or a scar on the finger. The method described herein relies more on other available information sources if one of the information sources is not reliable.

Current data fusion methods, such as Stacking, Majority Vote, Semidefinite programming offer classifier fusion capabilities, but they can be less accurate and less robust to noise. An alternative method (AdaBoost—MV) can be obtained by running boosting separately on each view, obtaining separate ensembles for each view and taking a majority vote among the ensembles when presented with test data. This approach is not very reliable in the presence of noise compared to the method illustrated in FIG. 1 and FIG. 2 and described above. Another approach (AdaBoost Concatenated) is to concatenate the features for all views and to run boosting on the concatenated feature space. However, this method can lead to a degradation of the performance due to the “curse of dimensionality”.

The method and system illustrated in FIG. 2 have been evaluated in various scenarios like face detection, gender classification and texture classification. The performance of the algorithm has been compared with other classifier fusion algorithms and its superiority over other fusion techniques has been established on most data sets with >95% confidence using a two-sided paired T-test.

FIGS. 3-5 show experimental results of testing the method of FIG. 3 (“BSSD”, or “Boosting with Shared Sampling Distribution”) and fusion methods such as stacked generalization (stacking), semidefinite programing (SDP/SVM) and majority vote (SVM-MV) with five data sets from the MIT VisTex texture database. The size and dimensions of the five data sets are shown in the following table.

Dataset generated from a Data set texture images database Vector dimensions for each R, G, B size Data set 1 D_(R) = 112, D_(G) = 113, D_(B) = 112 144 Data set 2 D_(R) = 84, D_(G) = 85, D_(B) = 86 128 Data set 3 D_(R) = 75, D_(G) = 74, D_(B) = 75 96 Data set 4 D_(R) = 53, D_(G) = 54, D_(B) = 53 64 Data set 5 D_(R) = 50, D_(G) = 52, D_(B) = 42 64

Three views (Red, Green, and Blue) are the components extracted from each image. Principal Component Analysis is used in order to reduce the dimensionality of the individual components.

The SVM algorithm used as a back-end generalizer in stacking has two procedural parameters: a and C, the soft margin parameter. Ten-fold cross-validation was used for model selection, taking σ values in [10⁻²,10²] and C values in [10²,10²]. Gaussian, polynomial and linear kernel functions were used on each view for the semidefinite programming technique. Modified C4.5 classifiers or the Naive Bayes classifiers are used as weak learners for boosting.

Results for data sets 1-5 are illustrated in the tables on FIG. 3 and 4. The results are the average accuracy of 20 tests, each time the datasets being randomly partitioned such that 60% of the data is in the training set and the remaining 40% is in the test set. The average accuracy of individual classifier from each view before fusion is shown in the columns A_(R), A_(G), and A_(B), for red, green, and blue, respectively. The average fusion accuracy is presented in column A_(fusion), FIG. 5 summarizes the fusion accuracy results of FIG. 3 and 4 for the five datasets.

FIG. 6 illustrates the results of comparing the BSSD method of FIG. 2 with another embodiment of a boosting method, in the presence of noise. The alternative embodiment, Boosting with Independent Sampling Distribution (BISD), is different from the FIG. 2 method in that the sampling distributions of the training points are disjoint for each view. As seen in FIG. 6, the BSSD method shows a greater robustness to noise, believed to be due to the self-regularizing aspect of the BSSD method.

FIGS. 7-15 illustrate the results of the BSSD method and other fusion methods. In these tests, the BSSD algorithm is applied to face images from the FERET database to solve three different classification problems (face detection, gender classification and detection of glasses (spectacles) on faces). The first two experiments consider the fusion of three views represented by the eigenfaces extracted from images with three head orientations (poses) of the same person. In the third experiment, the views are obtained by extracting features such as eigenfaces, detected edges and wavelet coefficients for each face image. Each of the data sets had a data set size of 101 vectors with 101 dimensions each (after applying principal component analysis for dimensionality reduction) for each of the three views.

Experimental results are presented in FIGS. 7, 8, 9, and 10 for the following methods: SVM-MV; Stacked—SVM; SDP-SVM; and BSSD. Fusion accuracy for FERET data sets 1, 2, and 3 is summarized in FIGS. 11, 12, and 13.

FIGS. 14, 15, and 16 illustrate experimental results of three data fusion methods (AdaBoost—MV; AdaBoost Concatenated; and BSSD) for the three FERET data sets.

The invention has been described with reference to certain preferred embodiments. It will be understood, however, that the invention is not limited to the preferred embodiments discussed above, and that modification and variations are possible within the scope of the appended claims. 

1. A computer-implemented robust method for fusing data from different information sources using a training set having a plurality of training examples, each training example having a plurality of disjoint views, the method comprising: a) initially assigning weights, by the computer, to each of the plurality of training examples; b) sampling the training examples, by the computer, based on the distribution of the weights of the training examples; c) iteratively, by the computer, for each of the views, separately training weak classifiers in parallel on the sample of training examples; d) selecting, by the computer, the weak classifier corresponding to the view with the lowest training error rate among all the views and calculating a combination weight value associated with the selected classifier as a function of the lowest training error rate at that iteration; e) updating the weights of the sampled training examples by, for each of the sampled training examples, assigning the same updated weight for sampling the training examples for all views, the updated weight distribution being a function of-the lowest training error rate among all views at that iteration; f) repeating said b) sampling, c) training, d) selecting, and e) updating for a predetermined number of iterations; and g) forming a final classifier that is a sum of the selected weak learners weighted by the corresponding combination weight value at each iteration.
 2. The method of claim 1, wherein said sampling the training examples includes selecting particular training examples from the training set based on the updated distribution of weights of the training examples at that iteration.
 3. The computer-implemented method of claim 1, wherein the initially assigned weight for each training example is 1/N, wherein N is a total number of training examples in the training set.
 4. The computer-implemented method of claim 1, wherein said calculating a combination weight value α_(k) ^(*) for a k^(th) iteration is according to an equation ${\alpha_{k}^{*} = {\frac{1}{2}{\ln\left( \frac{1 - ɛ_{k}^{*}}{ɛ_{k}^{*}} \right)}}},$ wherein α_(k) ^(*) is the combination weight value and ε^(*) _(k) is the lowest training error rate among the views in the k^(th) iteration.
 5. The computer-implemented method of claim 4, wherein the updated weight is ${w_{k + 1}(i)} = {\frac{w_{k}(i)}{Z_{k}^{*}} \times \left\{ {\begin{matrix} {\exp\left( {- \alpha_{k}^{*}} \right)} & {if} & {{h_{k}^{*}\left( x_{i}^{*} \right)} = y_{i}} \\ {\exp\left( \alpha_{k}^{*} \right)} & {if} & {{h_{k}^{*}\left( x_{i}^{*} \right)} \neq y_{i}} \end{matrix},} \right.}$ k is an iteration index, i is a training example index, w_(k)(i) is the weight of the views of the i^(th) training example at the k^(th) iteration, w_(k+l)(i) is the updated weight of i^(th) training example, Z_(k) ^(*) is a normalization factor, h_(k) ^(*)(x_(i) ^(*)) is the weak classifier with the lowest training error rate at the k^(th) iteration and y_(i) is a class label of the i^(th) training example.
 6. The computer-implemented method of claim 4, further comprising: producing a final classifier for fusing data from different information sources according to an equation ${F(x)} = {\sum\limits_{k = 1}^{k\mspace{11mu}\max}\;{\alpha_{k}^{*}{h_{k}^{*}\left( x^{*} \right)}}}$ on the computer, wherein F(x) is the final classifier, h_(k) ^(*)(x^(*)) is the weak classifier with the lowest training error rate at the k^(th) iteration, and k_(max) is the predetermined number of iterations.
 7. The computer-implemented method of claim 1, wherein the information sources include at least two sensors operating at different frequencies.
 8. The computer-implemented method of claim 1, wherein the information sources and training examples include at least two of visible range data, infrared sensors data and radar data.
 9. The computer-implemented method of claim 1, wherein the views are different color intensities extracted from an image data set.
 10. The computer-implemented method of claim 1, wherein the disjoint views are from a same data set, each view capturing a different aspect of the data.
 11. Computer readable media having computer readable instructions recorded thereon for fusing data from different information sources using a training set having a plurality of training examples, each training example having a plurality of disjoint views, said data from different information sources and said training examples being data from at least one sensor, the computer readable media comprising: an assignment module including instructions for initially assigning weights to each of a plurality of training examples; a training module including instructions for sampling the training examples based on the distribution of the weights of the training examples and, iteratively for each view, separately training weak classifiers in parallel on the sample of training examples; a selector including instructions for selecting a weak classifier at that iteration corresponding to the view with the lowest training error rate among all the views and calculating a combination weight value associated with the selected classifier as a function of the lowest training error rate at that iteration; an updater including instructions for assigning the weights for all views of that training example with the same updated weight for sampling the training example, the updated weight distribution being a function of the lowest training error rate among all views at that iteration; wherein the training module, the selector, and the updater repeat said sampling, said training, said selecting, and said updating for a predetermined number of iterations; and instructions for forming a final classifier that is a sum of the selected weak classifiers weighted by the corresponding combination weight value at each iteration.
 12. The computer readable media according to claim 11, wherein the computer readable media is a component of an automatic target recognition system or an intelligent electronic navigation system.
 13. The computer readable media according to claim 11, wherein the information source is at least one of visible range data, infrared sensors data, or radar data.
 14. The computer readable media of claim 11, wherein the computer readable media outputs the final classifier that is an ensemble of the selected weak learners corresponding to those views with the lowest training error at each iteration.
 15. The computer readable media of claim 11, wherein the initially assigned weight for each training example is 1/N, wherein N is a total number of training examples in the training set.
 16. The computer readable media of claim 11, wherein said combination weight value α_(k) ^(*) is calculated according to an equation ${\alpha_{k}^{*} = {\frac{1}{2}{\ln\left( \frac{1 - ɛ_{k}^{*}}{ɛ_{k}^{*}} \right)}}},$ wherein k is an iteration index, α_(k) ^(*) is the combination weight value and ε_(k) ^(*) is the lowest training error rate among the views in a k^(th) iteration
 17. The computer readable media of claim 16, wherein the updated weight value is ${w_{k + 1}(i)} = {\frac{w_{k}(i)}{Z_{k}^{*}} \times \left\{ {\begin{matrix} {\exp\left( {- \alpha_{k}^{*}} \right)} & {if} & {{h_{k}^{*}\left( x_{i}^{*} \right)} = y_{i}} \\ {\exp\left( \alpha_{k}^{*} \right)} & {if} & {{h_{k}^{*}\left( x_{i}^{*} \right)} \neq y_{i}} \end{matrix},} \right.}$ wherein i is a training example index, w_(k)(i) is the weight of the views of the i^(th) training example at the k^(th) iteration, w_(k+l) (i) is the updated weight of i^(th) training example, Z_(k) ^(*) is a normalization factor, h_(k) ^(*)(x_(i) ^(*)) is the weak classifier with the lowest training error rate at the kth iteration and y_(i) is the class label of the i^(th) training example.
 18. The computer readable media according to claim 17, wherein the final classifier is found according to an equation ${{F(x)} = {\sum\limits_{k = 1}^{k\mspace{11mu}\max}\;{\alpha_{k}^{*}{h_{k}^{*}\left( x^{*} \right)}}}},$ wherein F(x) is the final classifier, and k_(max) is the predetermined number of iterations. 